The depth of intuitionistic cut free proofs
نویسندگان
چکیده
We prove a quadratic upper bound for the depth of cut free proofs in propositional intuitionistic logic formalized with Gentzen’s sequent calculus. We discuss bounds on the necessary number of reuses of left implication rules. We exhibit an example showing that this quadratic bound is optimal. As a corollary, this gives a new proof that propositional validity for intuitionistic logic is in PSPACE.
منابع مشابه
Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic
The size of shortest cut-free proofs of first-order formulas in intuitionistic sequent calculus is known to be non-elementary in the worst case in terms of the size of given sequent proofs with cuts of the same formulas. In contrast to that fact, we provide an elementary bound for the size of cut-free proofs for disjunction-free intuitionistic logic for the case where the cut-formulas of the or...
متن کاملSome Pitfalls of LK-to-LJ Translations and How to Avoid Them
In this paper, we investigate translations from a classical cut-free sequent calculus LK into an intuitionistic cut-free sequent calculus LJ. Translations known from the literature rest on permutations of inferences in classical proofs. We show that, for some classes of rst-order formulae, all minimal LJ-proofs are non-elementary but there exist short LK-proofs of the same formula. Similar resu...
متن کاملCut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic
We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are in 1-1 correspondence with the normal natural deduction proofs of intuitionistic logic. We present a simple proof of Herbelin’s strong cutelimination theorem for the calculus, using the recursive path ordering theorem of Dershowitz.
متن کاملRevisiting the Correspondence between Cut Elimination and Normalisation
Cut-free proofs in Herbelin’s sequent calculus are in 1-1 correspondence with normal natural deduction proofs. For this reason Herbelin’s sequent calculus has been considered a privileged middle-point between L-systems and natural deduction. However, this bijection does not extend to proofs containing cuts and Herbelin observed that his cutelimination procedure is not isomorphic to β-reduction....
متن کاملComplexity Analysis of Cut Elimination in First Order Based Logics
The worst-case complexity of cut elimination in sequent calculi for first order based logics is investigated in terms of the increase in logical depth of the deduction. It is shown that given a calculus satisfying a general collection of sufficient conditions for cut elimination and given a deduction with cuts, there exists a cut free deduction with a logical depth, in the worst case, hyper-exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003